Bibliometric Analysis of Research on Mental Health in the Workplace in Canada 1991-2002

This paper uses the Medline biomedical papers database to measure scientific production on mental health in the workplace (MHWP) during the 1991-2002 period at the world, Canadian, provincial, urban, institutional and researcher levels. The level of scientific output has doubled at the world level and tripled at the Canadian level during the last 12 years. At the provincial level, Ontario, Quebec, British Columbia and Alberta are leading in absolute number of papers. Ontario largely dominates both in terms of output and on a per capita basis. At the level of cities, Toronto and Montreal are the largest producers of papers on MHWP. The most important institutions in terms of papers on MHWP are McMaster University, Université de Montréal, the University of Toronto, the University of British Columbia and the University of Western Ontario. The universities with the largest number of active researchers in MHWP are McMaster University, Université Laval and York University

Differential Equations for Algebraic Functions

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential equation of minimal order has coefficients whose degree is cubic in the degree of the function. We also show that there exists a linear differential equation of order linear in the degree whose coefficients are only of quadratic degree. Furthermore, we prove the existence of recurrences of order and degree close to optimal. We study the complexity of computing these differential equations and recurrences. We deduce a fast algorithm for the expansion of algebraic series

Corriger la Logique des Défauts par la Logique des Défauts

National audienceCe papier se situe dans le contexte de la fusion de sources d'information représentées à l'aide de la logique des défauts. Plus précisément, celui-ci se focalise sur la résolution du problème apparaissant quand les connaissances classiques des sources sont contradictoires, ayant pour effet de rendre triviale la théorie avec défauts résultante. Pour outre-passer ce problème, il est montré que, remplacer chaque formule appartenant aux sous-ensembles minimaux inconsistants (MUSes) de la réunion des connaissances classiques des sources par une règle de défaut super-normale correspondante, présente un comportement intéressant. De plus, il est examiné comment ces règles de défaut supplémentaires interagissent avec les règles de défaut initiales de la théorie. Chose intéressante, cette approche nous permet de manier le problème de théories avec défauts contenant des connaissances classiques contradictoires, en utilisant le cadre de la logique des défauts lui-même

Using Local Search to Find \MSSes and MUSes

International audienceIn this paper, a new complete technique to compute Maximal Satisfiable Subsets (MSSes) and Minimally Unsatisfiable Subformulas (MUSes) of sets of Boolean clauses is introduced. The approach improves the currently most efficient complete technique in several ways. It makes use of the powerful concept of critical clause and of a computationally inexpensive local search oracle to boost an exhaustive algorithm proposed by Liffiton and Sakallah. These features can allow exponential efficiency gains to be obtained. Accordingly, experimental studies show that this new approach outperforms the best current existing exhaustive ones

Preemption Operators (NMR 2012)

International audienceWe introduce a family of operators for belief change that aim at making a new piece of information to be preemptive so that any former belief subsuming it is given up. That is, the current belief base is to be altered even in the case that it is logically consistent with the new piece of information. Existing operators for belief revision are inadequate for this purpose because they amount to settheoretic union in a contradiction-free case.We propose a series of postulates for such preemption operators.We show that a preemption operator can be defined as a multiple contraction followed by an expansion, drawing on operators from belief revision

Logic-based Fusion of Legal Knowledge

International audienceIn this paper, we address several issues that are often overlooked in the fusion of various knowledge components when this knowledge is expressed in full standard logic. It is shown that not solving these issues can lead to inadequate inferences. As a case study, we consider the legal domain, which has been an application target for knowledge engineering for decades. Real- life examples based on the confrontation of two different legal systems about a same international agreement are investigated

Preserving Partial Solutions while Relaxing Constraint Networks

International audienceThis paper is about transforming constraint net- works to accommodate additional constraints in specific ways. The focus is on two intertwined issues. First, we investigate how partial solutions to an initial network can be preserved from the potential impact of additional constraints. Second, we study how more permissive constraints, which are intended to enlarge the set of solutions, can be accommodated in a constraint network. These two problems are studied in the general case and the light is shed on their relationship. A case study is then investigated where a more permissive additional constraint is taken into account through a form of network relaxation, while some previous partial solutions are preserved at the same time

A CSP solver focusing on FAC variables

International audienceThe contribution of this paper is twofold. On the one hand, it introduces a concept of FAC variables in discrete Constraint Satisfaction Prob- lems (CSPs). FAC variables can be discovered by local search techniques and powerfully exploited by MAC-based methods. On the other hand, a novel syn- ergetic combination schema between local search paradigms, generalized arc- consistency and MAC-based algorithms is presented. By orchestrating a multiple- way flow of information between these various fully integrated search compo- nents, it often proves more competitive than the usual techniques on most classes of instances

Relax!

International audienceThis paper is concerned with a form of relaxation of constraint networks. The focus is on situations where additional constraints are intended to extend a non- empty set of preexisting solutions. These constraints require a speci c treatment since merely inserting them inside the network would lead to their preemption by more restrictive ones. Several approaches to handle these additional constraints are investigated from con- ceptual and experimental points of view